Logical Description of Contex-Free Graph Languages
نویسندگان
چکیده
A graph language L is in the class C-edNCE of context-free edNCE graph languages if and only if L = f(T) where f is a function on graphs that can be deened in monadic second-order logic and T is the set of all trees over some ranked alphabet. This logical characterization implies a large number of closure and decidability properties of the context-free edNCE graph languages. Rather than context-free graph grammars we use regular path descriptions to deene graph languages.
منابع مشابه
Leveraging Lexical Semantics to Infer Context-Free Grammars
Context-free grammars cannot be identified in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans learn them with remarkable ease from positive examples (Marcus, 1993). Identifiability results for formal languages ignore a potentially powerful source of information available to learners of natural languages, namely...
متن کاملAn XML-Based Description of Structured Networks
In this paper we present an XML-based formalism to describe hierarchically organized communication networks. After a short overview of existing graph description languages, we discuss the advantages and disadvantages of their application in network optimization. We conclude by extending one of these formalisms with features supporting the description of the relationship between the optimized lo...
متن کاملSyntactic Variety in Boundary Logic
Boundary logic is a formal diagrammatic system that combines Peirce's Entitative Graphs with Spencer Brown's Laws of Form. Its conceptual basis includes boundary forms composed of non-intersecting closed curves, voidsubstitution (deletion of irrelevant structure) as the primary mechanism of reduction, and spatial pattern-equations that define valid transformations. Pure boundary algebra, free o...
متن کاملAcquisition of Terminological Knowledge from Social Networks in Description Logic
The Web Ontology Language (OWL) has gained serious attraction since its foundation in 2004, and is heavily used in applications requiring representation of as well as reasoning with knowledge. It is the language of the Semantic Web, and has a strong logical underpinning by means of so-called Description Logics (DLs). DLs are a family of conceptual languages suitable for knowledge representation...
متن کاملFormal Languages and Finite Cellular Automata
A bst ract. A one-dimensional cellular automaton rule with specified boundary conditions can be considered as acting simultaneously on all finite lattices, which gives a mapping between formal languages. Regular lang uages are always mapped to regular langu ages, contex t-free to context-free, context-sensitive to context-sensitive, and recursive sets to recursive sets . In particular, the fini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 55 شماره
صفحات -
تاریخ انتشار 1997